The number of convex polyominos with given perimeter
نویسندگان
چکیده
منابع مشابه
The convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملThe number of permutations with a given number of sequences
P (n, s) denotes the number of permutations of 1, 2,. .. n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P (n, s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly and also obtain explicit expressions for P (n, s) and its fixed-s generating function us(x).
متن کاملConvex lattice polygons of fixed area with perimeter-dependent weights.
We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a ...
متن کاملThe minimal number with a given number of divisors
A number n is said to be ordinary if the smallest number with exactly n divisors is p q1−1 1 · · · p qa−1 a where q1 · · · qa is the prime factorization of n and q1 ≥ . . . ≥ qa (and where pk denotes the k-th prime). We show here that all square–free numbers are ordinary and that the set of ordinary numbers has natural density one.
متن کاملArea and Perimeter of the Convex Hull of Stochastic Points
Given a set P of n points in the plane, we study the computation of the probability distribution function of both the area and perimeter of the convex hull of a random subset S of P . The random subset S is formed by drawing each point p of P independently with a given rational probability πp. For both measures of the convex hull, we show that it is #P-hard to compute the probability that the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90079-9